Nearly Space-Filling Fractal Networks of Carbon Nanopores
نویسندگان
چکیده
منابع مشابه
Nearly space-filling fractal networks of carbon nanopores.
Small-angle x-ray scattering, nitrogen adsorption, and scanning tunneling microscopy show that a series of activated carbons host an extended fractal network of channels with dimension D(p) = 2.8-3.0 (pore fractal), channel width 15-20 A (lower end of scaling), network diameter 3000-3400 A (upper end of scaling), and porosity of 0.3-0.6. We interpret the network as a stack of quasiplanar invasi...
متن کاملWater filling of hydrophilic nanopores.
Molecular dynamics simulations of water in cylindrical hydrophilic pores with diameters of 1.5 and 3 nm were performed to explore the phase behavior and the nucleation dynamics of the confined fluid as a function of the percentage of volume filled f. The interactions of water with the pore wall were considered to be identical to the interactions between water molecules. At low water contents, a...
متن کاملEfficient Nearly Orthogonal and Space-Filling Latin Hypercubes
This article presents an algorithm for constructing orthogonal Latin hypercubes, given a fixed sample size, in more dimensions than previous approaches. In addition, we detail a method that dramatically improves the space-filling properties of the resultant Latin hypercubes at the expense of inducing small correlations between the columns in the design matrix. Although the designs are applicabl...
متن کاملAn Algorithm for Random Fractal Filling of Space
Computational experiments with a simple algorithm show that it is possible to fill any spatial region with a random fractalization of any shape, with a continuous range of pre-specified fractal dimensions D. The algorithm is presented here in 1, 2, or 3 physical dimensions. The size powerlaw exponent c or the fractal dimension D can be specified ab initio over a substantial range. The method cr...
متن کاملFilling Space with Random Fractal Non-Overlapping Simple Shapes
We present an algorithm that randomly places simple shapes (circles, squares, triangles, and others) without overlap in two dimensions. We describe the mathematics of the process in detail with some conjectures about its properties. The distribution of the areas of the shapes is a power law with varying exponents (typically around -1.3 for visual art). When the algorithm continues "to infinity"...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2002
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.88.115502